Robust Multigrid for Isogeometric Analysis Based on Stable Splittings of Spline Spaces
نویسندگان
چکیده
We present a robust and efficient multigrid method for single-patch isogeometric discretizations using tensor product B-splines of maximum smoothness. Our method is based on a stable splitting of the spline space into a large subspace of “interior” splines which satisfy a robust inverse inequality, as well as one or several smaller subspaces which capture the boundary effects responsible for the spectral outliers which occur in Isogeometric Analysis. We then construct a multigrid smoother based on an additive subspace correction approach, applying a different smoother to each of the subspaces. For the interior splines, we use a mass smoother, whereas the remaining components are treated with suitably chosen Kronecker product smoothers or direct solvers. We prove that the resulting multigrid method exhibits iteration numbers which are robust with respect to the spline degree and the mesh size. Furthermore, it can be efficiently realized for discretizations of problems in arbitrarily high geometric dimension. Some numerical examples illustrate the theoretical results and show that the iteration numbers also scale relatively mildly with the problem dimension.
منابع مشابه
JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics A Robust Multigrid Method for Isogeometric Analysis using Boundary Correction
The fast solution of linear systems arising from an isogeometric discretization of a partial differential equation is of great importance for the practical use of Isogeometric Analysis. For classical finite element discretizations, multigrid methods are well known to be fast solvers showing optimal convergence behavior. However, if a geometric multigrid solver is naively applied to a linear sys...
متن کاملA Robust Multigrid Method for Isogeometric Analysis using Boundary Correction
The fast solution of linear systems arising from an isogeometric discretization of a partial differential equation is of great importance for the practical use of Isogeometric Analysis. For classical finite element discretizations, multigrid methods are well known to be fast solvers showing optimal convergence behavior. However, if a geometric multigrid solver is naively applied to a linear sys...
متن کاملRobust and optimal multi-iterative techniques for IgA collocation linear systems
We consider fast solvers for the large linear systems coming from the Isogeometric Analysis (IgA) collocation approximation based on B-splines of full elliptic d-dimensional Partial Differential Equations (PDEs). We are interested in designing iterative algorithms which are optimal and robust. The former property implies that the computational cost is linear with respect to the number of degree...
متن کاملSymbol-Based Multigrid Methods for Galerkin B-Spline Isogeometric Analysis
We consider the stiffness matrices coming from the Galerkin B-spline isogeometric analysis approximation of classical elliptic problems. By exploiting specific spectral properties compactly described by a symbol, we design efficient multigrid methods for the fast solution of the related linear systems. We prove the optimality of the two-grid methods (in the sense that their convergence rate is ...
متن کاملSpectral Analysis of Geometric Multigrid Methods for Isogeometric Analysis
We investigate geometric multigrid methods for solving the large, sparse linear systems which arise in isogeometric discretizations of elliptic partial differential equations. We observe that the performance of standard V-cycle iteration is highly dependent on the spatial dimension as well as the spline degree of the discretization space. Conjugate gradient iteration preconditioned with one V-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 55 شماره
صفحات -
تاریخ انتشار 2017